Wireless delivery of broadcast data

ABSTRACT

Systems and methods for improved content streaming and downloading. The system enables content to be transmitted to wireless base stations (WBSs) using unicast on the core network side of a cellular network to avoid incompatibilities associated with network broadcast technologies such as Evolved Multimedia Broadcast Multicast Services (eMBMS) and Long-Term Evolution Broadcast (LTE-B). At the same time, the system enable content to be broadcast, or transmitted to multiple user equipment (UE) in a single transmission to reduce wireless bandwidth consumption. The system can include a commodity server to receive requests from WBSs, place them in a chronological list based on network latency, and then transmit content to each WBS in a synchronized unicast manner. Each WBS can then transmit the content to a plurality of UEs with minimal buffer required due to the “pre-synchronization.”

CROSS REFERENCE TO RELATED APPLICATIONS

This Application is a non-provisional of, and claims priority under 35U.S.C. § 119(e) to, U.S. Provisional Application No. 62/541,588, filedAug. 4, 2017, of the same title, the entire disclosure of which ishereby incorporated by reference in its entirety.

BACKGROUND

Data can be sent wirelessly to multiple users in a variety of ways. Thedata can be sent unicast, or “end-to-end,” in which data is sent by aprovider (e.g., a digital content provider on the Internet) and routedthrough the Internet, cellular core network, and directly to the enduser. When multiple users request the same data from the same cell siteat substantially the same time or request a live stream, however, thedata can be sent by the provider, through the Internet, cellular corenetwork, and broadcast to multiple users at the same time. In otherwords, though the data is being sent to multiple users, it need only betransmitted once by a particular cell site.

Wireless broadcast is an efficient method to deliver data to multipleusers, compared with sending unicast to each member individually.Technologies such as Evolved Multimedia Broadcast Multicast Services(eMBMS) and Long-Term Evolution Broadcast (LTE-B) have leveragedinternet protocol (IP) multicast in the transport network to quicklyreplicate data packets from a content provider server towards the cellsite, or wireless base station (WBS)—e.g., eNodeB.

To enable the data from the content provider to be sent to multiple cellsites, the data is first replicated by the network. Moving replicationfrom the origin server to the network leverages efficiencies in thenetwork, but only if that network efficiently supports IP multicast. Dueto the complexity and variability in the modern cellular core network,however, supporting IP multicast in the network can be problematic.

BRIEF DESCRIPTION OF THE DRAWINGS

The detailed description is set forth with reference to the accompanyingfigures. In the figures, the left-most digit(s) of a reference numberidentifies the figure in which the reference number first appears. Theuse of the same reference numbers in different figures indicates similaror identical items or features.

FIG. 1 depicts an example of a commodity server for providing content aplurality of user equipment (UEs) connected to a cellular core network,in accordance with some examples of the present disclosure.

FIGS. 2A and 2B are flowcharts depicting an example of a method forsending content over the core network using traditional unicasttransmission, but broadcasting the content from wireless base stations(WBSs) to the UEs, in accordance with some examples of the presentdisclosure.

FIG. 3 is a flowchart depicting an example of a method for placing theUEs in chronological order according to descending network latency, inaccordance with some examples of the present disclosure.

FIG. 4 is an example of a UE for use with the systems and methodsdisclosed herein, in accordance with some examples of the presentdisclosure.

FIG. 5 is an example of a commodity server for use with the systems andmethods disclosed herein, in accordance with some examples of thepresent disclosure.

FIG. 6 is an example of a cellular and internet protocol network for usewith the systems and methods disclosed herein, in accordance with someexamples of the present disclosure.

DETAILED DESCRIPTION

Examples of the present disclosure can comprise systems and methods forproviding IP broadcast services over a variety of cellular networks. Thesystem maintains network simplicity, while moving complexity associatedwith IP broadcast into a dedicated component—e.g., a commodity server,clouds of servers, application specific integrated circuit (ASIC), orfield programmable gate arrays (FPGAs) on the server (collectively,“commodity servers”)—to do more complex tasks such as data replicationand time synchronization.

As mentioned above, for a variety of reasons, many portions of thecellular core network do not efficiently support broadcast services.Meanwhile, wired network communications (e.g., fiber optic, cable, andother wired connections) on the Internet and within the core networkprovide essentially limitless capacity. Due to the proliferation ofwireless communications devices, however, wireless, and particularlycellular, bandwidth is at a premium. To this end, examples of thepresent disclosure can modify portions of current core network IPmulticast mechanisms in concert with other technologies such asMultimedia Broadcast Multicast Services (eMBMS), Long-Term EvolutionBroadcast (LTE-B), and similar data distribution technologies to providehighly scalable, quasi-synchronous, unicast distribution of data towireless base-stations, or “cell sites.” Content can then be efficientlybroadcast from cell sites to users in a single transmission, reducingwireless bandwidth requirements. A combination of software advances andleveraging ASICs and FGPAs on commodity servers can bring nearsynchronous replication and distribution of unicast data to a wide set(10s, 100s, 1,000s, etc.) of wireless base stations (WBSs).

As shown in FIG. 1, examples of the present disclosure can comprise asystem 100 for providing content to WBSs using unicast on the corenetwork side to avoid incompatibilities and broadcast on the wirelessside to reduce bandwidth consumption. As mentioned above, the wiredportion of the cellular network, or core network, has essentiallyunlimited bandwidth. High-speed cable, fiber optic, and otherconnections can provide incredible bandwidth (or, throughput); and,while they are not literally unlimited, transmissions speeds on theorder of terabytes per second are possible. As a result, examples of thepresent disclosure can use unicast transmission over the core network toavoid broadcast compatibility issues, while using broadcast transmissionfrom the WBSs to the users' equipment (UEs) to reduce wireless bandwidthconsumption.

To this end, the system 100 can comprise one or more commodity servers102 configured to receive content from content servers 104. Thecommodity server 102 can comprise a single server or one or more cloudsof servers, ASICs, FPGAs, tablet computers, laptops, or other electronicdevices. As discussed below, the commodity server 102 can shift some, orall, of the replication and synchronization steps from the core network108 to the commodities server 102.

The content servers 104 can comprise servers, clouds of servers, orother computational devices used to stream live broadcasts, podcasts,streaming content, and other internet data. The content servers 104 cancomprise third party content servers such as, for example, You Tube, TVstreaming sites (e.g., Hulu), podcasts, and other third party content.The content servers 104 can also comprise components of the core network108 configured to download content from third-party servers to make thecontent available “inside” the core network 108.

As used herein, the core network 108 can comprise the “back-end” of thecellular communications network. Thus, the core network 108 can includemultiple servers, routers, and other components such as, for example,Third Generation Partnership Program Authentication, Authorization andAccounting (3GPP AAA), proxy-call session control function (P-CSCF),interrogating-call session control function (I-CSCF), etc. Thus, thecore network 108 is responsible for routing calls from one userequipment (UE) 110 to another UE, from the Internet to UEs 110, etc. Thecore network 108 is also responsible for roaming, billing, and otherfunctions needed for the cellular network to function.

The UEs 110 can comprise a variety of electronic devices capable of oneor more types of wireless communication (e.g., cellular, Wi-Fi,Bluetooth®, etc.). The UEs 110 can comprise, for example, cell phones,smart phones, tablet computers, laptops, desktops, smart watches, andother electronic devices. In this case, the UEs 110 can enable users tostream video and/or audio content from various content providers via thecontent servers 104.

Conventionally, content would be downloaded from a content server 104 tocomponents on the core network 108, replicated by one or more componentsof the core network 108, and then distributed to multiple WBSs 106(i.e., using IP multicast). This configuration was initially implementeddue to the performance limitations of servers at the time, particularlythe content servers 104, which dictated that the replication beperformed on multiple, powerful computers within the core network 108.This configuration removed the burden from the content servers 104, forexample, but placed the burden on the core network 108.

As technology has shifted, however, core network 108 bandwidth (e.g.,wired internet bandwidth) has increased, while processing load on thecore network 108 has also increased. Thus, components of the corenetwork 108 tend to be overloaded, while bandwidth across the corenetwork 108 is somewhat underutilized. To this end, shifting some of theprocessing burden off of the core network 108, while utilizing excessnetwork bandwidth can be beneficial. As mentioned above, due advances insoftware, ASICs, FGPAs, and other features now available on thecommodity server 102, the commodity server 102 can now perform nearsynchronous replication and distribution of unicast data to a wide set(10s, 100s, 1,000s, etc.) of WBSs 106. Thus, the commodity server 102can receive the data from a content provider and can also be configuredwith, or can discover, a set of WBSs requesting to receive thebroadcast.

Based on this set of WBSs 106, the commodity server 102 and the set ofWBSs 106 exchange capabilities and willingness to join in the broadcastflow. Thus, each WBS 106 can provide an IP address to the commodityserver 102, for example. The WBSs 106 may also provide performancerequirements (e.g., bandwidth limits, file formats, etc.) to enable thecommodity server 102 to send the appropriate content. Thus, WBSs 106with limited bandwidth capabilities due to technical limitations, hightraffic, or poor conditions may receive lower resolution video, forexample, and vice-versa.

The commodity server 102 compiles a list of WBSs 106 receiving theunicast packets. The list can include various specifications for each ofthe WBSs 106 including, for example, the distance from the commodityserver 102 to the WBS 106, any network induced latency, bandwidthrestraints, etc. Thus, the delivery and time alignment of the unicastpackets can be optimized by the commodity server 102.

The commodity server 102 can be responsible for replicating the datapackets for unicast to each WBS 106. This shifts the burden from thecore network 108 to the dedicated commodity server 102. In addition, thecommodity server 102 can be responsible for synchronization, such thateach WBS 106 receives each respective packet of data at substantiallythe same time. Thus, the commodity server 102 can send data packets toWBSs 106 that are farther away and/or have higher network latenciesfirst, and vice-versa. Thus, while some buffer may be involved toaccount for unknown or variable factors (e.g., changing network loads),the amount of buffer required is minimized by the commodities server102, further freeing up network resources.

Upon receipt of the data packet, the WBSs 106 can then broadcast thedata packet to each user equipment (UE) 110 using a broadcast algorithm.In some examples, the broadcast algorithm can again synchronize thetransmission to a timestamp in the packet, for example, or based on atimestamp provided by the previous packet. This can enable content to bebroadcast “live”, but with some minimal delay, or to enable content tobe broadcast sequentially (e.g., part 1 of the content, followed by part2, etc.). Because the packet has been sent “pre-synchronized” by thecommodity server 102, however, buffer time in the broadcast algorithmcan be significantly reduced. In other words, by synchronizing thebroadcast at two stages—by the commodity server 102 and by the broadcastalgorithm at the WBSs 106—buffer time at the WBSs 106 is reduced, oreliminated. This further shifts precious resources (e.g., buffer) fromthe network to the commodities server 102.

The commodity server 102 or the WBS 106 can trigger an end to thebroadcast and/or being removed from the set of WBSs 106 receiving thebroadcast. Thus, the commodity server 102 can send each successive datapacket in the same manner until all data has been sent (e.g., asimulcast ends) or until a WBS 106 requests to be removed from the list.This may be because there are no longer any users connected to the WBS106 requesting that particular broadcast (e.g., all users have droppedoff or have moved to another WBS 106).

Thus, the system 100 moves replication and synchronization burden off ofthe core network 108 and onto the commodities server 102. Yet, becausethe data is nonetheless sent unicast to each of the WBSs 106, the system100 reduces deployment barriers (e.g., supporting IP multicast)associated with Third Generation Partnership Project (3GPP) definedeMBMS or LTE-B broadcast techniques. As mentioned above, the burden onrelatively scarce computing resources on the core network 108 arereduced, while relatively plentiful bandwidth is utilized. In addition,multiple synchronization stages smooth unicast delivery of synchronizedcontent and reduce buffer.

As shown in FIG. 2, examples of the present disclosure can also comprisea method 200 for providing content to WBSs using unicast on the corenetwork side to avoid incompatibilities and broadcast on the wirelessside to reduce bandwidth consumption. As mentioned above, the method 200can shift processing duties off of relatively high loaded core network108 components and onto dedicated commodity servers 102. The method 200can also avoid compatibility issues caused by eMBMS or LTE-B broadcasttechniques, because network-side communications utilize conventionalunicast technologies. Yet, broadcasting can be used from WBSs 106 tocontent requesters—users requesting content via UEs 110—to maximizewireless bandwidth.

At 202, therefore, the method 200 can begin with a plurality of UEs 110requesting content from a content server 104 via one or more WBSs 106.Obviously, if only one UE 110 is requesting content from a particularWBS 106, then that UE 110 can be served using tradition end-to-endunicast transmission—i.e., no bandwidth savings are realized bybroadcasting to a single UE 110. Each WBS 106 from which more than oneUE 110 has requested the same content, on the other hand, can benefitfrom broadcasting the content once to multiple UE 110.

At 204, the WBS 204 can send the request for content to the core network108. The request can include, for example, an IP address, website, orother relevant information for the applicable content server 104 andsimilar information for the WBS 106. The request can also includeinformation regarding the content requested. The content can comprise,for example, live streaming for a particular channel, a podcast, or asimulcast of a sporting event, among other things. In some examples, therequest can simply comprise a hyperlink or a SIP message with therelevant information for the content and the WBS 106.

At 206, rather than requesting the content directly from the contentserver 104, the core network 108 can request the content from thecommodity server 102. Indeed, in some examples, the core network 108 maysimply pass the message along from the WBS 106 to the commodity server102. As mentioned above, in this manner, the burden of replicating androuting the content to the plurality of WBSs 106 is shifted off of thecore network 108 and onto the commodity server 102.

At 208, the commodity server 102 can request the content from thecontent server 104. In this configuration, however, rather thanreplicating the content at the content server 104, only a single copy ofthe content needs to be downloaded to the commodity server 102. Thecontent may be downloaded as a complete file, packet-by-packet, or inany manner deemed suitable. Thus, the burden of replicating and routingthe content to the plurality of WBSs 106 is shifted from the contentserver 104 to the commodity server 102.

At 210, the commodity server 102 can begin the download of the contentfrom the content server 104. In many cases, such as when then content islive streaming, the content can be downloaded to the commodity server102 in packets, for example, or individual portions of files, that aredownloaded in near real-time—i.e., as quickly as allowable based onnetwork and content server 104 latency, etc. The individual files can beindependently playable, for example, and can be provided to the UEs 110such that no interruption in the content is perceived by the user.

At 212, the commodity server 102 can compile a list of WBSs 106 fromwhich the same content has been requested. The list can be ordered bythe commodity server 102 such that the list is ordered based on thedistance, network latency, and other factors related to the timerequired to send data to each WBS 106. So, the closest WBS 106 with thelowest latency, for example, would be last on the list, and vice-versa.In this manner, all WBSs 106 on the list can receive the content atsubstantially the same time. And, while the commodity server 102 mayintroduce some buffer to account for unknown variables in transmission,the buffer is minimized by the ordering of the list.

At 214, the commodity server 102 can replicate the content based on thenumber of WBSs 106 on the list. In some examples, the commodity server102 can also replicate the content some number of “extra” times toaccount for WBSs 106 that join the broadcast in the interim. Asmentioned above, replicating the content on the commodity server 102shifts this burden off of the content server 104 and onto the dedicatedcommodity server 102.

As shown in FIG. 2B, at 216, the commodity server 102 can begin theprocess of sending each packet, at the appropriate time, to each WBS106. The method 200 can begin by setting a first counter, X, associatedwith the current packet number to 1. At 218, a second counter, Y,associated with the current WBS 106 to 1. Thus, the method 200 can firstsend packet(1) to WBS(1) 106, for example. AS discussed above, WBS(1)106 is the first WBS 106 on the aforementioned list, and is actually theWBS 106 that is the “farthest” time-wise from the commodity server102—i.e., the travel time (distance multiplied by propagation speed)combined with any network latency between the commodity server 102 andWBS(1) 106 is the greatest.

At 220, prior to sending packet(1) to WBS(1) 106, the commodity server102 can determine if, in the interim, WBS(1) 106 has requested to beremoved from the list. This may be because, in the interim, all, or allbut one, of the UEs 110 requesting the content from UBS(1) 106 havecanceled their request. This may be because the users simply decided notto watch the content, the user moved from WBS(1) 106 to another WBS 106(i.e., they are moving), the UEs 110 disconnected from WBS(1) 106, orsome other reason. Revising the list prior to sending packet(1),however, can prevent unnecessary data from being sent over the network,reducing bandwidth consumption.

At 222, if, for any reason, there are no longer any UEs 110 connected toUBS(1) 106, the method 200 can remove WBS(1) 160 from the list prior tosending the data packet. In some examples, if there is only one UE 110connected to WBS(1) that is requesting the content, WBS(1) can also beremoved from the list, as no wireless bandwidth savings are provided bybroadcasting to a single UE 110. On the other hand, from a routingstandpoint and based on the other efficiencies of the system 100 (e.g.,performing replication on the commodity server 102), the method 200 cannonetheless leave UBS(1) 106 on the list.

At 224, if UBS(1) is removed from the list, the method 200 can incrementY by one to move to the next WBS 106 subscribed to the content, in thiscase WBS(2) and the method 200 can continue iteratively at 220.

At 226, if WBS(1) 160 has not requested to be removed from the list, onthe other hand, the method 200 can send packet(1) to WBS(1) 106. Asmentioned above, in some examples, packet(1) may literally be a packetof data that forms part of the stream for the requested content. Inother examples, the packet can be a complete file that represents aportion of the content. So, for example, a video simulcast may be splitinto multiple video files (e.g., .avi, .mov., .mpeg, etc.), each ofwhich are separately playable. These files can then be downloaded to theUEs 110 and can be played in chronological order providing substantiallyseamless playback.

At 228, regardless of the form of the data, the method 200 can thendetermine if the current WBS(1) 160 is the “last” WBS 160 on the list,or if WBS(1)=WBS(Max). This ensures that packet(1) is sent to all WBSs106 on the lost prior to moving on to packet(2). In this case, assumingmore than one WBS 106 is subscribed to the content, then WBS(1) 106 isnot the last WBS 106 on the list, and the method 200 continues.

At 224, since WBS(1) 106 is not the last WBS 106 on the list (i.e.,WBS(1)≠WBS(Max)), Y is incremented by one. This enables the system 100to send packet(1) to, in this case, WBS(2) 106. In this manner,packet(1) is sent sequentially to each WBS 106 in the list from WBS(1)to WBS(Max) and from the WBS 106 that is “farthest” from the commodityserver 102 to the WBS 106 that is closest.

At 230, if WBS(1) 106 is the last WBS 106 on the list (i.e.,WBS(1)=WBS(Max)), then the method 200 next checks to see if all packetsfor the content have been sent; or, in this case, ifpacket(1)=packet(Max). Assuming that there is more than one data packet,then packet(1) is not the last packet on the list (i.e.,packet(1)≠packet(max)), and the method 200 continues iteratively untilall packets have been sent to all WBSs 106.

At 232, therefore, X is incremented by 1 to begin the process forsending packet(2), in this case, to all of the subscribed WBSs 106. At218, the method 200 continues iteratively by setting Y back to 1. Thisenables the system 100 to send packet(2) to UBS(1) 106 continuing theprocess of sending packet(2) to all of the subscribed WBSs 106. Asmentioned above, during each iteration, the system 100 can determine ifa particular WBS 106 is still subscribed and remove those that are not.

At 230, at some point, all packets will have been sent to all WBSs 106(i.e., packet(X)=packet(Max) and WBS(Y)=WBS(Max)). At 234, therefore,the commodity server 102 can optionally send a termination message tothe WBSs 106. Obviously, reaching the “end” of the content could signifythe end of a live simulcast, for example, the end of a podcast, or someother event. In some examples, the “end” could also signify that allWBSs 106 have unsubscribed from that particular content. Regardless, thecommodity server 102 can send a separate message terminating thebroadcast, include the termination in the last packet (i.e.,packet(Max)), or simply stop transmitting. In the latter case, theconnections between the commodity server 102, core network 108, and WBSs106 may terminate automatically after a predetermined amount of time,obviating the need for a termination message.

As mentioned above, at least a portion of the efficiency of the system100 can be attributed to improved synchronization. In other words,conventionally, content is sent somewhat randomly from the contentserver 104 through the core network 108 to the WBSs 106 and timesynchronization (whether absolute or relative to the content) is leftsolely to the WBSs 106. This results in increased processing load on theWBSs 106 and increased buffer times.

As shown in FIG. 3, therefore, examples of the present disclosure canalso comprise a method 300 to synchronize the content at the commodityserver 102 with a chronological list of WBSs 106 prior to transmittingthe content. In this manner, while some synchronization may still berequired by the WBSs 106, processing demands and overall buffer (e.g.,buffer at the commodity server 102+buffer at the WBSs 106) is reduced.In other words, since the network latency—i.e., the total transmissionlatency for a particular WBS 106, including distance from the commodityserver 102, errors, switching time, and other network delays—for eachWBS 106 is accounted for in the transmission, each WBS 106 receives thepacket at substantially the same time. This also enables the timebetween when the packet is received and when the packet is to be played,or buffer time, to be reduced.

As shown in FIG. 3, therefore, as the commodity server 102 receives eachrequest from each WBS 106 for the same content, the WBS 106 can be addedto the list in chronological order, with the WBS 106 with the highestnetwork latency first on the list and vice-versa. At 302, to this end,the counter for the request, X, can be set to 1—i.e., the first requestreceived is request(1).

EXAMPLE 1

At 304, the commodity server 102 can receive a request for content froma WBS(X) 106, in this case WBS(1) 106, or the first WBS 106 to requestthe content. As mentioned above, therefore, the only significance toWBS(1) 106 is that it was the first WBS 106 to request the content. Asdiscussed below, it will nonetheless be placed in the appropriatelocation in the chronological list based on its network latency.

At 306, the commodity server 102 can calculate the distance from thecommodity server 102 to WBS(1) 106. This may be included in the requestfrom WBS(1) 106, for example, or may be provided in a lookup tableaccessible to the commodity server 102. At 308, the commodity server 102may also calculate the latency to WBS(1) 160. The latency can be causedby switching, errors, jitter, and other factors in the core network 108.Again, this can be provided in the request or may be provided in alookup table accessible to the commodity server 102. At 310, thecommodity server can combine the delay caused simply by the travel timeto WBS(1) 160 and the latency caused by other factors in the corenetwork 108 to calculate the total latency, or network latency forWBS(1) 160. Indeed, in some examples, the commodity server 102 cancombine steps 308 and 310 and can determine the total network latency(time to travel+latency) based on the request itself. In other words,based on when the request was sent and received (as provided in thetimestamp of the request), the commodity server 102 can determine thenetwork latency for WBS(1) 106. In some examples, the commodity server102 can also periodically “ping” each WBS 106 on the list to determinenetwork latency.

At 312, regardless of how the network latency is determined, the method300 can continue by inserting the current request (from WBS(1) 106)chronologically in the list. In other words, requests with lower latency(less time) go lower on the list, and vice-versa. In this case, sincethis is the first request, WBS(1) 106 is both the first request in thelist and the last, because WBS(1) 106 is the only request this far. Thesorting process can be executed by the commodity server 102 using bubblesorting or another suitable sorting algorithm known in the art.

At 314, X is incremented by one and the method 300 continues with thenext request, in this case a request from WBS(2) 106.

EXAMPLE 2

Requested Order Network Latency Chronological List (WBS(X)) (ms) 1WBS(3) 45 ms 2 WBS(2) 35 ms 3 WBS(4) 25 ms 4 WBS(1) 10 ms

As shown above, in this example, there are already four entries in thechronological list, which have been reordered from their originalrequest order (X)—i.e., the order in which they were received—into achronological list. At this point, X=5 (the next request to come in willbe the fifth request). At 304, therefore, a new request comes in to thecommodity server 102 from WBS(5) 106. In this example, we will assumethat WBS(5) has a network latency of 30 ms. Skipping ahead to 310,therefore, regardless of how it was determined, Latency(5)=30 ms.

At 312, Latency(5)−30 ms—is compared to Latency(1) in the chronologicallist—45 ms—and is found to be less than Latency(1), compared toLatency(2), etc., and is ultimately inserted third in the chronologicallist. Of course, at the same time, the current third and fourth entriesin the chronological list are moved down one slot:

Requested Order Network Latency Chronological List (WBS(X)) (ms) 1WBS(3) 45 ms 2 WBS(2) 35 ms 3 WBS(5) 30 ms 4 WBS(4) 25 ms 5 WBS(1) 10 ms

At 314, X is again incremented by one to await the next request, in thiscase from WBS(6).

As shown in FIG. 4, the system 100 and methods 200, 300 can be used inconjunction with a UE 110 that can comprise a variety of electronicdevices. For clarity, the UE 110 is described herein generally as a cellphone or smart phone. One of skill in the art will recognize, however,that the system 100 and methods 200, 300 can also be used with a varietyof other electronic devices, such as, for example, tablet computers,laptops, desktops, and other network (e.g., cellular or IP network)connected devices from which audio, video, and other content can beconsumed. These devices are referred to collectively as UEs 110.

The UEs 110 can comprise a number of components to execute theabove-mentioned functions. As discussed below, the UEs 110 can comprisememory 402 including many common features such as, for example, thecontacts 404, calendar 406, navigation software 408, and the operatingsystem (OS) 410. In this case, the memory 402 can also include, forexample, one or more video applications 412 (e.g., You Tube or Hulu) anda podcast application 414 (e.g., Overcast or Pod Wrangler).

The UEs 110 can also comprise one or more processors 416. In someimplementations, the processor(s) 416 can be a central processing unit(CPU), a graphics processing unit (GPU), or both CPU and GPU, or anyother sort of processing unit. The UEs 110 can also include one or moreof removable storage 418, non-removable storage 420, transceiver(s) 422,output device(s) 424, and input device(s) 426. In some examples, such asfor cellular communication devices, the UEs 110 can also include asubscriber identification module (SIM) 428 including an InternationalMobile Subscriber Identity (IMSI), and other relevant information.

In various implementations, the memory 402 can be volatile (such asrandom access memory (RAM)), non-volatile (such as read only memory(ROM), flash memory, etc.), or some combination of the two. The memory402 can include all, or part, of the functions 404, 406, 408, 412, 414and the OS 410 for the UEs 110, among other things.

The memory 402 can also comprise contacts 404, which can include names,numbers, addresses, and other information about the user's business andpersonal acquaintances, among other things. In some examples, the memory402 can also include a calendar 406, or other software, to enable theuser to track appointments and calls, schedule meetings, and providesimilar functions. In some examples, the memory 402 can also comprisenavigation software 408 such as global positioning system (GPS) and/orcellular location based navigation systems. Of course, the memory 402can also include other software such as, for example, e-mail, textmessaging, social media, and utilities (e.g., calculators, clocks,compasses, etc.).

The memory 402 can also include the OS 410. Of course, the OS 410 variesdepending on the manufacturer of the UE 110 and currently comprises, forexample, iOS 10.3.2 for Apple products and Oreo for Android products.The OS 410 contains the modules and software that supports a computer'sbasic functions, such as scheduling tasks, executing applications, andcontrolling peripherals.

As mentioned above, the UE 110 can also include a video application 412and a podcast application 414, among other things. The video application412 can enable the UE 110 to download, store, and play live andprerecorded video, audio, and other content. Thus, the user may connectto the Internet or a cellular data network using the transceiver(s) 422to download or stream content from the content servers 104, in somecases via the commodity server 102. Thus, in some case, the videoapplication 412 can include a suitable graphical user interface (GUI),video playback capabilities including codecs and other information, andan audio component in communication with speakers on the UE 110, amongother things.

In some examples, the UE 110 can also include a podcast application 414.The podcast application 414 can be similar to the video application, butcan be tailored for downloaded and/or streaming podcasts and similarcontent. Thus, the podcast application 414 may include a differentbrowser, or “podcatcher,” and/or include bookmarks for podcast specificwebsites and providers (e.g., NPR, Soundcloud, etc.)

The UEs 110 may also include additional data storage devices (removableand/or non-removable) such as, for example, magnetic disks, opticaldisks, or tape. Such additional storage is illustrated in FIG. 4 byremovable storage 418 and non-removable storage 420. The removablestorage 418 and non-removable storage 420 can store some, or all, of thefunctions 404, 406, 408 and/or OS 410.

Non-transitory computer-readable media may include volatile andnonvolatile, removable and non-removable tangible, physical mediaimplemented in technology for storage of information, such as computerreadable instructions, data structures, program modules, or other data.The memory 402, removable storage 418, and non-removable storage 420 areall examples of non-transitory computer-readable media. Non-transitorycomputer-readable media include, but are not limited to, RAM, ROM,electronically erasable programmable ROM (EEPROM), flash memory or othermemory technology, compact disc ROM (CD-ROM), digital versatile disks(DVD) or other optical storage, magnetic cassettes, magnetic tape,magnetic disk storage or other magnetic storage devices, or any othertangible, physical medium which can be used to store the desiredinformation and which can be accessed by the UEs 110. Any suchnon-transitory computer-readable media may be part of the UEs 110 or maybe a separate database, databank, remote server, or cloud-based server.

In some implementations, the transceiver(s) 422 include any sort oftransceivers known in the art. In some examples, the transceiver(s) 422can include wireless modem(s) to facilitate wireless connectivity withthe other UEs, the Internet, and/or an intranet via a cellularconnection. Further, the transceiver(s) 422 may include a radiotransceiver that performs the function of transmitting and receivingradio frequency communications via an antenna (e.g., Wi-Fi orBluetooth®). In other examples, the transceiver(s) 422 may include wiredcommunication components, such as a wired modem or Ethernet port, forcommunicating with the other UEs or the provider's Internet-basednetwork.

In some implementations, the output device(s) 424 include any sort ofoutput devices known in the art, such as a display (e.g., a liquidcrystal or thin-film transistor (TFT) display), a touchscreen display,speakers, a vibrating mechanism, or a tactile feedback mechanism. Insome examples, the output devices can play various sounds based on, forexample, whether the UEs 110 is connected to a network, the type of callbeing received (e.g., video calls vs. voice calls), the number of activecalls, etc. Output device(s) 424 also include ports for one or moreperipheral devices, such as headphones, peripheral speakers, or aperipheral display.

In various implementations, input device(s) 426 include any sort ofinput devices known in the art. For example, the input device(s) 426 mayinclude a camera, a microphone, a keyboard/keypad, or a touch-sensitivedisplay. A keyboard/keypad may be a standard push button alphanumeric,multi-key keyboard (such as a conventional QWERTY keyboard), virtualcontrols on a touchscreen, or one or more other types of keys orbuttons, and may also include a joystick, wheel, and/or designatednavigation buttons, or the like.

As shown in FIG. 5, the system 100 and methods 200, 300 can also be usedin conjunction with the commodity server 102, which can comprise avariety of electronic devices. As mentioned above, the commodity server102 can comprise a supplementary server as part of the core network 108,or can be a standalone server for use with the system 100 and methods200, 300 discussed herein.

The commodity server 102 can comprise a number of components to executethe above-mentioned functions and apps. As discussed below, thecommodity server 102 can comprise memory 502 including many commonfeatures such as, for example, the OS 504, content handling algorithm506, and one or more chronological lists 508 (of WBSs 106).

The commodity server 102 can also comprise one or more processors 510.In some implementations, the processor(s) 510 can be a centralprocessing unit (CPU), a graphics processing unit (GPU), or both CPU andGPU, or any other sort of processing unit. The commodity server 102 canalso include one or more of removable storage 512, non-removable storage514, transceiver(s) 516, output device(s) 518, and input device(s) 520.

In various implementations, the memory 502 can be volatile (such asrandom access memory (RAM)), non-volatile (such as read only memory(ROM), flash memory, etc.), or some combination of the two. The memory502 can include all, or part, of the functions 506, 508 for thecommodity server 102, among other things. The memory 502 can alsoinclude the OS 504. Of course, the OS 504 varies depending on themanufacturer of the commodity server 102 and the type of component. Manyservers, for example, run Linux or Windows Server. Dedicated cellularrouting servers may run specific telecommunications OSs 504. The OS 504contains the modules and software that supports a computer's basicfunctions, such as scheduling tasks, executing applications, andcontrolling peripherals.

In some examples, depending in the server's function, the commodityserver 102 can also comprise a content handling algorithm 506. Thecontent handling algorithm 506 can enable the commodity server 102 toreceive the requests from the WBSs 106, compile the chronological list508, and transmit the content to the WBSs 106. As mentioned above, thecontent handling algorithm 506 can enable the content to be sent to theWBSs 106 in descending order of network latency. In this manner, anybuffer required at the WBS 106 is minimized because all WBSs 106 receivethe content at substantially the same time.

The commodity server 102 may also include additional data storagedevices (removable and/or non-removable) such as, for example, magneticdisks, optical disks, or tape. Such additional storage is illustrated inFIG. 5 by removable storage 512 and non-removable storage 514. Theremovable storage 512 and non-removable storage 514 can store some, orall, of the OS 504 and functions 506, 508.

Non-transitory computer-readable media may include volatile andnonvolatile, removable and non-removable tangible, physical mediaimplemented in technology for storage of information, such as computerreadable instructions, data structures, program modules, or other data.The memory 502, removable storage 512, and non-removable storage 514 areall examples of non-transitory computer-readable media. Non-transitorycomputer-readable media include, but are not limited to, RAM, ROM,EEPROM, flash memory or other memory technology, CD-ROM, DVDs or otheroptical storage, magnetic cassettes, magnetic tape, magnetic diskstorage or other magnetic storage devices, or any other tangible,physical medium which can be used to store the desired information andwhich can be accessed by the commodity server 102. Any suchnon-transitory computer-readable media may be part of the commodityserver 102 or may be a separate database, databank, remote server, orcloud-based server.

In some implementations, the transceiver(s) 516 include any sort oftransceivers known in the art. In some examples, the transceiver(s) 516can include wireless modem(s) to facilitate wireless connectivity withthe other UEs, the Internet, and/or an intranet via a cellularconnection. Further, the transceiver(s) 516 may include a radiotransceiver that performs the function of transmitting and receivingradio frequency communications via an antenna (e.g., Wi-Fi orBluetooth®). In other examples, the transceiver(s) 516 may include wiredcommunication components, such as a wired modem or Ethernet port, forcommunicating with the other UEs or the provider's Internet-basednetwork.

In some implementations, the output device(s) 518 include any sort ofoutput devices known in the art, such as a display (e.g., a liquidcrystal or thin-film transistor (TFT) display), a touchscreen display,speakers, a vibrating mechanism, or a tactile feedback mechanism. Insome examples, the output devices can play various sounds based on, forexample, whether the commodity server 102 is connected to a network,when requests are received from WBSs 106, etc. Output device(s) 518 alsoinclude ports for one or more peripheral devices, such as headphones,peripheral speakers, or a peripheral display.

In various implementations, input device(s) 520 include any sort ofinput devices known in the art. For example, the input device(s) 520 mayinclude a camera, a microphone, a keyboard/keypad, or a touch-sensitivedisplay. A keyboard/keypad may be a standard push button alphanumeric,multi-key keyboard (such as a conventional QWERTY keyboard), virtualcontrols on a touchscreen, or one or more other types of keys orbuttons, and may also include a joystick, wheel, and/or designatednavigation buttons, or the like.

FIG. 6 depicts a conventional cellular network 600 including 2G 602, 3G604, and 4G long-term evolution (LTE) 606 components. Of course, futuretechnologies, such as, for example, 5G, 6G, Internet of Things (IoT),and device-to-device (D2D) components could also be included and arecontemplated herein. As mentioned above, many of the “back-end”components of the network 600 currently handle some, or all, of thereplication and routing for content. Indeed, some, or all, of theaforementioned content handling algorithm 506 and chronological lists508 could be located on one or more of, for example, the HLR/HSS 622,the 3GPP AAA server 626, or other components. In other words, thecommodity server 102 can be standalone or can be integrated into one ormore of the existing network components.

As is known in the art, data can be routed from the Internet or othersources using a circuit switched modem connection (or non-3GPPconnection) 608, which provides relatively low data rates, or via packetswitched IP networks 610 connections, which results is higher bandwidth.The LTE system 606, which is purely IP based, essentially “flattens” thearchitecture, with data going straight from the internet to the servicearchitecture evolution gateway (SAE GW) 612 to evolved Node Btransceivers 606, enabling higher throughput. Many UEs 110 also havewireless local area network (WLAN) 614 capabilities, in some casesenabling even higher throughput. In some cases, cellular carriers mayuse WLAN communications in addition to, or instead of, cellularcommunications to supplement bandwidth.

The serving GPRS support node (SGSN) 616 is a main component of thegeneral packet radio service (GPRS) network, which handles all packetswitched data within the network 600—e.g. the mobility management andauthentication of the users. The MSC 618 essentially performs the samefunctions as the SGSN 616 for voice traffic. The MSC 618 is the primaryservice delivery node for global system for mobile communication (GSM)and code division multiple access (CDMA), responsible for routing voicecalls and short messaging service (SMS) messages, as well as otherservices (such as conference calls, fax, and circuit switched data). TheMSC 618 sets up and releases the end-to-end connection, handles mobilityand hand-over requirements during the call, and takes care of chargingand real time pre-paid account monitoring.

Similarly, the mobility management entity (MME) 620 is the keycontrol-node for the 4G LTE network 606. It is responsible for idle modeUE 110 paging and tagging procedures including retransmissions. The MME620 is involved in the bearer activation/deactivation process and isalso responsible for choosing the SAE GW 612 for the UE 110 at theinitial attach and at time of intra-LTE handover involving Core Network(CN) node relocation (i.e., switching from one cell site to the nextwhen traveling). The MME 620 is responsible for authenticating the user(by interacting with the HSS 622 discussed below). The Non-AccessStratum (NAS) signaling terminates at the MME 620 and it is alsoresponsible for generation and allocation of temporary identities to UE110. The MME 620 also checks the authorization of the UE 110 to camp onthe service provider's HPLMN or VPLMN and enforces UE 110 roamingrestrictions on the VPLMN. The MME 620 is the termination point in thenetwork for ciphering/integrity protection for NAS signaling and handlesthe security key management. The MME 620 also provides the control planefunction for mobility between LTE 606 and 2G 602/3G 604 access networkswith the S3 interface terminating at the MME 620 from the SGSN 616. TheMME 620 also terminates the S6 a interface towards the home HSS 622 forroaming UEs 110.

The HSS/HLR 622 is a central database that contains user-related andsubscription-related information. The functions of the HSS/HLR 622include functionalities such as mobility management, call and sessionestablishment support, user authentication and access authorization. TheHSS, which is used for LTE connections, is based on the previous HLR andAuthentication Center (AuC) from CGMA and GSM technologies, with eachserving substantially the same functions for their respective networks.

The policy and charging rules unction (PCRF) 624 is a software node thatdetermines policy rules in the network 600. The PCRF 624 is generallyoperates at the network core and accesses subscriber databases (e.g.,the HSS/HLR 622) and other specialized functions, such as contenthandling (e.g., whether the user has sufficient data left in theirplan), in a centralized manner. The PCRF 624 is the main part of thenetwork 600 that aggregates information to and from the network 600 andother sources (e.g., IP networks 610). The PCRF 624 can support thecreation of rules and then can automatically make policy decisions foreach subscriber active on the network 600. The PCRF 624 can also beintegrated with different platforms like billing, rating, charging, andsubscriber database or can also be deployed as a standalone entity.

Finally, the 3GPP AAA server 626 performs authentication, authorization,and accounting (AAA) functions and may also act as an AAA proxy server.For WLAN 614 access to (3GPP) IP networks 610 the 3GPP AAA Server 626provides authorization, policy enforcement, and routing information tovarious WLAN components. The 3GPP AAA Server 626 can generate and reportcharging/accounting information, performs offline charging control forthe WLAN 614, and perform various protocol conversions when necessary.

As shown, in some examples, the 3GPP AAA server 626 can contain some, orall, of the components of the system 100. In some examples, the 3GPP AAAServer 626 can include, for example, the content handling algorithm 506and the one or more chronological lists 508. Of course, as mentionedabove, other components (e.g., the HSS/HLR 622) could also include some,or all, of the system 100.

As shown, in some examples, the commodity server 102 can be connected toone or more IP networks 610 to provide access to the content servers104. The commodity server 102 can then be in communication with the corenetwork 108 and ultimately the WBSs 106. In this examples, the commodityserver 102 is shown “outside” the core network 108 and in communicationwith the SAE GW 612. As mentioned above, however, in some examples, thecommodity server 102 can be “inside” the core network 108. In thisconfiguration, the commodity server 102 can download content from thecontent servers 104, for example, which can be directly available tocomponents of the core network 108.

While several possible examples are disclosed above, examples of thepresent disclosure are not so limited. For instance, while the systemsand methods above are discussed with reference to use with cellularcommunications, the systems and methods can be used with other types ofwired and wireless communications. In addition, while various functionsare discussed as being performed on the commodity server 102 and/orvarious components on the cellular network 600, other components couldperform the same or similar functions without departing from the spiritof the invention.

The specific configurations, connections, and network routing can bevaried according to particular design specifications, networkconfigurations, and/or constraints requiring a UE 110, commodity server102, system 100, or method 200, 300 constructed according to theprinciples of this disclosure. Such changes are intended to be embracedwithin the scope of this disclosure. The presently disclosed examples,therefore, are considered in all respects to be illustrative and notrestrictive. The scope of the disclosure is indicated by the appendedclaims, rather than the foregoing description, and all changes that comewithin the meaning and range of equivalents thereof are intended to beembraced therein.

What is claimed is:
 1. A method comprising: receiving, at a transceiverof a commodity server, a plurality of requests from a plurality ofwireless base stations (WBSs) for content; requesting, with thetransceiver of the commodity server, the content from one or morecontent servers; receiving, with the transceiver of the commodityserver, the content from the one or more content servers; dividing, witha processor of the commodity server, the content into at least twopackets of data; determining, with the processor of the commodityserver, a network latency for each of the plurality of WBSs; ordering,with the processor of the commodity server, the plurality of WBSs into achronological list starting with a first WBS with a longest networklatency and ending with a second WBS with a shortest network latency;replicating, with the processor of the commodity server, the content anumber of times equal to a number of WBSs in the plurality of WBSs; andtransmitting, with the transceiver of the commodity server via a corenetwork of a cellular communications network, the content to each of theWBSs according to the chronological list starting with the first WBS andending with the second WBS; wherein transmitting the content to each ofthe WBSs according to the chronological list comprises: transmitting afirst packet of the at least two packets of the content to each of theWBSs according to the chronological list starting with the first WBS andending with the second WBS; and transmitting a second packet of the atleast two packets of the content to each of the WBSs according to thechronological list starting with the first WBS and ending with thesecond WBS; and wherein transmitting the content according to thechronological list enables the content to be transmitted to each WBSusing unicast transmissions.
 2. The method of claim 1, wherein each ofthe plurality of WBSs receives at least two requests for the contentfrom at least two user equipment (UEs) in communication with arespective WBS prior to sending the request to the commodity server. 3.The method of claim 1, further comprising: broadcasting, from atransceiver of a first WBS of the plurality of WBSs, the content totransceivers of at least two UEs in communication with the first WBS;wherein the content is transmitted to the transceivers of the at leasttwo UEs simultaneously in a single broadcast.
 4. The method of claim 1,wherein receiving, with the transceiver of the commodity server, thecontent from the one or more content servers comprises: receiving afirst packet of data comprising a first portion of the content; andreceiving a second packet of data comprising a second portion of thecontent; and wherein transmitting the content to each of the WBSsaccording to the chronological list comprises: transmitting the firstpacket to each of the WBSs according to the chronological list startingwith the first WBS and ending with the second WBS; and transmitting thesecond packet to each of the WBSs according to the chronological liststarting with the first WBS and ending with the second WBS.
 5. Themethod of claim 1, further comprising: transmitting, with thetransceiver of the commodity server, a termination message to theplurality of WBSs when the content has been transmitted to the pluralityof WBSs.
 6. The method of claim 1, further comprising: receiving, at atransceiver of a first WBS of the plurality of WBSs, a unicasttransmission from the commodity server including at least a firstportion of the content from the commodity server, the first portion ofthe content including a timestamp; and broadcasting, with thetransceiver, the first portion to a plurality of UEs in communicationwith the first WBS at a time provided in the timestamp; wherein thecontent is transmitted to the plurality of UEs simultaneously in asingle broadcast.
 7. A system comprising: a commodity server comprising:one or more transceivers to send and receive one or more wirelesstransmissions; memory storing a content-handling algorithm; and one ormore processors in communication with at least the one or moretransceivers and the memory, wherein the content-handling algorithmcauses the one or more processors to: receive, at the one or moretransceivers, a plurality of requests from a plurality of wireless basestations (WBSs) to subscribe to a content; request, with the one or moretransceivers, the content from one or more content servers; divide thecontent into at least two packets of data; determine, with the one ormore processors, a network latency for each of the plurality of WBSs;replicate, with the one or more processors, the content a number oftimes equal to a number of WBSs in the plurality of WBSs; and transmit,with the one or more transceivers via a core network of a cellularcommunications network, the content to each of the WBSs according to achronological list starting with a first WBS and ending with a secondWBS; wherein transmitting the content to each of the WBSs according tothe chronological list comprises: transmitting a first packet of the atleast two packets of the content to each of the WBSs according to thechronological list starting with the first WBS and ending with thesecond WBS; and transmitting a second packet of the at least two packetsof the content to each of the WBSs according to the chronological liststarting with the first WBS and ending with the second WBS; and whereintransmitting the content according to the chronological list enables thecontent to be transmitted to each WBS via the core network using unicasttransmissions.
 8. The system of claim 7, wherein each of the pluralityof WBSs receives at least two requests for the content from at least twouser equipment (UEs) in communication with a respective WBS.
 9. Thesystem of claim 7, wherein the content-handling algorithm furthercausing the one or more processors to: transmit, with the one or moretransceivers, a termination message to the plurality of WBSs when thecontent has been transmitted to the plurality of WBSs.
 10. The system ofclaim 7, wherein the first WBS of the plurality of WBSs comprises: oneor more transceivers to send and receive one or more wirelesstransmissions; memory storing a broadcast algorithm; and one or moreprocessors in communication with at least the one or more transceiversand the memory, wherein the broadcast algorithm causes the one or moreprocessors to: receive, at the one or more transceivers of the firstWBS, the content from the commodity server, the content including atimestamp; and broadcasting, with a first transceiver of the one or moretransceivers, the content to a plurality of UEs in a singletransmission.
 11. The system of claim 10, wherein receiving, at the oneor more transceivers of the first WBS, the content from the commodityserver comprises: receiving a first packet of data comprising a firstportion of the content and a first timestamp; and receiving a secondpacket of data comprising a second portion of the content and a secondtimestamp.
 12. The system of claim 11, wherein broadcasting the contentto the plurality of UEs at a time provided in the timestamp comprises:broadcasting, with the one or more transceivers of the first WBS, thefirst packet at a first time provided in the first timestamp; andbroadcasting, with the one or more transceivers of the first WBS, thesecond packet at a second time provided in the second timestamp.
 13. Thesystem of claim 7, the content-handling algorithm further causing theone or more processors to: receive, at the one or more transceivers, asecond plurality of requests from a second plurality of wireless basestations (WBSs) to subscribe to a second content; request, with the oneor more transceivers, the second content from the one or more contentservers; determine, with the one or more processors, a network latencyfor each of the second plurality of WBSs; replicate, with the one ormore processors, the second content a number of times equal to a numberof WBSs in the second plurality of WBSs; and transmit, with the one ormore transceivers via a core network of a cellular communicationsnetwork, the second content to each of the second plurality of WBSsaccording to a second chronological list starting with a third WBS andending with a fourth WBS; wherein transmitting the content according tothe second chronological list enables the content to be transmitted toeach of the second plurality of WBSs via the core network using unicasttransmissions; and wherein the third WBS has a longest network latencyof the second plurality of WBSs and the fourth WBS has a shortestnetwork latency of the second plurality of WBSs.
 14. The system of claim7, wherein the first WBS has a longest network latency of the pluralityof WBSs and the second WBS has a shortest network latency of theplurality of WBSs.
 15. A computing device comprising: one or moretransceivers to send and receive one or more wireless transmissions;memory storing a content-handling algorithm; and one or more processorsin communication with at least the one or more transceivers and thememory, wherein the content-handling algorithm causes the one or moreprocessors to: receive, at the one or more transceivers, a plurality ofrequests from a plurality of wireless base stations (WBSs) for content;request, at the one or more transceivers, the content from one or morecontent servers; receive, at the one or more transceivers, the contentfrom the one or more content servers; determine, with the one or moreprocessors, a network latency for each of the plurality of WBSs;replicating, with the one or more processors, the content a number oftimes equal to a number of WBSs in the plurality of WBSs; and transmit,at the one or more transceivers via a core network of a cellularcommunications network, the content to each of the WBSs according to achronological list starting with a first WBS and ending with a secondWBS; wherein transmitting the content to each of the WBSs according tothe chronological list comprises: transmitting a first packet of thecontent to each of the WBSs according to the chronological list startingwith the first WBS and ending with the second WBS; and transmitting asecond packet of the content to each of the WBSs according to thechronological list starting with the first WBS and ending with thesecond WBS; and wherein transmitting the content according to thechronological list enables the content to be transmitted to each WBSusing unicast transmissions.
 16. The computing device of claim 15,wherein the request includes at least one of an IP address, a hyperlink,a SIP message, or a website.
 17. The computing device of claim 15,wherein the content comprises at least one of live streaming for aparticular channel, a podcast, or a simulcast of a sporting event. 18.The computing device of claim 15, wherein the chronological list isbased at least in part on a distance that the plurality of WBSs are fromthe computing device.
 19. The computing device of claim 15, furthercomprising replicating the content a number of times greater than thenumber of WBSs in the plurality of WBSs.
 20. The computing device ofclaim 15, wherein the first WBS has a longest network latency of theplurality of WBSs and the second WBS has a shortest network latency ofthe plurality of WBSs.